An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases
نویسندگان
چکیده
Abstract Weighted knowledge bases for description logics with typicality have been recently considered under a “concept-wise” multipreference semantics (in both the two-valued and fuzzy case), as basis of logical multilayer perceptrons (MLPs). In this paper we consider weighted conditional $\mathcal{ALC}$ in finitely many-valued case, through three different semantic constructions. For boolean fragment $\mathcal{LC}$ exploit answer set programming asprin reasoning concept-wise entailment $\varphi$ -coherent , suitable to characterize stationary states MLPs. As proof concept, experiment proposed approach checking properties trained
منابع مشابه
Paraconsistent Knowledge Bases and Many-Valued Logic
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge bases. We present a paraconsistent many-valued logic with a simple and n...
متن کاملA Distributional Semantics Approach for Selective Reasoning on Commonsense Graph Knowledge Bases
Tasks such as question answering and semantic search are dependent on the ability of querying & reasoning over large-scale commonsense knowledge bases (KBs). However, dealing with commonsense data demands coping with problems such as the increase in schema complexity, semantic inconsistency, incompleteness and scalability. This paper proposes a selective graph navigation mechanism based on a di...
متن کاملComments on Many-Valued Semantics for Vague
As the title suggests, the authors propose a framework for analyzing vague counterfac-tuals in the framework of fuzzy logics. Although both subjects have been studied for quite a long time, Cerami and Pardo present one of the first attempts combining them (this topic is also independently studied by Běhounek and Majer). Many philosophers have attempted to provide logical analysis of counterfact...
متن کاملTruth and knowledge fixpoint semantics for many-valued logic programming
The variety of semantical approaches that have been invented for logic programs for reasoning about inconsistent databases is quite broad. Especially, we are interested in an ontological encapsulation of a many-valued logics with negation, based on bilattices, into a 2-valued logic: this new approach is a minimilistic one based on the concept of the semantic reflection. We define a Model theore...
متن کاملComplexity Results for Default Reasoning from Conditional Knowledge Bases
Conditional knowledge bases have been proposed as belief bases that include defeasible rules (also called defaults) of the form “ ! ”, which informally read as “generally, if then .” Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2022
ISSN: ['1471-0684', '1475-3081']
DOI: https://doi.org/10.1017/s1471068422000163